Spanning Tree Transformation of Connected Graphs into Single-Row Networks
نویسندگان
چکیده
A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR). Keywords—Graph theory, simulated annealing, single-row routing and spanning tree.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملScale-Free properties of weighted random graphs: Minimum Spanning Trees and Percolation
We study Erdös-Rényi random graphs with random weights associated with each link. In our approach, nodes connected by links having weights below the percolation threshold form clusters, and each cluster merges into a single node, thus generating a new “clusters network”. We show that this network is scale-free with λ = 2.5. Furthermore, we show that optimization causes the percolation threshold...
متن کاملSeries-parallel subgraphs of planar graphs
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected (respectively, 2-edge-connected) spanning partial 2-tree (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs.
متن کاملA simple existence criterion for normal spanning trees in infinite graphs
A spanning tree of an infinite graph is normal if the endvertices of any chord are comparable in the tree order defined by some arbitrarily chosen root. (In finite graphs, these are their ‘depth-first search’ trees; see [3] for precise definitions.) Normal spanning trees are perhaps the most important single structural tool for analysing an infinite graph (see [4] for a good example), but they ...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کامل